On Ternary Square-free Circular Words
نویسنده
چکیده
Circular words are cyclically ordered finite sequences of letters. We give a computer-free proof of the following result by Currie: square-free circular words over the ternary alphabet exist for all lengths l except for 5, 7, 9, 10, 14, and 17. Our proof reveals an interesting connection between ternary square-free circular words and closed walks in the K3,3 graph. In addition, our proof implies an exponential lower bound on the number of such circular words of length l and allows one to list all lengths l for which such a circular word is unique up to isomorphism.
منابع مشابه
There Are Ternary Circular Square-Free Words of Length n for n >= 18
There are circular square-free words of length n on three symbols for n ≥ 18. This proves a conjecture of R. J. Simpson.
متن کاملCyclically repetition-free words on small alphabets
All sufficiently long binary words contain a square but there are infinite binary words having only the short squares 00, 11 and 0101. Recently it was shown by J. Currie that there exist cyclically square-free words in a ternary alphabet except for lengths 5, 7, 9, 10, 14, and 17. We consider binary words all conjugates of which contain only short squares. We show that the number c(n) of these ...
متن کاملOn the Entropy and Letter Frequencies of Ternary Square-Free Words
We enumerate all ternary length-` square-free words, which are words avoiding squares of words up to length `, for ` ≤ 24. We analyse the singular behaviour of the corresponding generating functions. This leads to new upper entropy bounds for ternary square-free words. We then consider ternary square-free words with fixed letter densities, thereby proving exponential growth for certain ensemble...
متن کاملImproved bounds on the number of ternary square-free words
Improved upper and lower bounds on the number of squarefree ternary words are obtained. The upper bound is based on the enumeration of square-free ternary words up to length 110. The lower bound is derived by constructing generalised Brinkhuis triples. The problem of finding such triples can essentially be reduced to a combinatorial problem, which can efficiently be treated by computer. In part...
متن کاملA Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$
We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we • characterize all the (two-way) infinite ternary square-free words avoiding letter pattern xyzxzyx • characterize the lexicographically least (one-way) infinite ternary square-free w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 17 شماره
صفحات -
تاریخ انتشار 2010